Affine Subspace Concentration Conditions
نویسندگان
چکیده
We define a new notion of affine subspace concentration conditions for lattice polytopes, and prove that they hold smooth reflexive polytopes with barycenter at the origin. Our proof involves considering slope stability canonical extension tangent bundle by trivial line class $c_1(\mathcal{T}_X)$ on Fano toric varieties.
منابع مشابه
On the Complements of Affine Subspace Arrangements
Let V be an l−dimensional real vector space. A subspace arrangement A is a finite collection of affine subspaces in V . There is no assumption on the dimension of the elements of A. Let M(A) = V −∪A∈AA be the complement of A. A method of calculating the additive structure of H(M(A)) was given in [G-MP] using stratified Morse theory, proving that H(M(A)) depends only on the set of all intersecti...
متن کاملAffine Subspace Representation for Feature Description
This paper proposes a novel Affine Subspace Representation (ASR) descriptor to deal with affine distortions induced by viewpoint changes. Unlike the traditional local descriptors such as SIFT, ASR inherently encodes local information of multi-view patches, making it robust to affine distortions while maintaining a high discriminative ability. To this end, PCA is used to represent affinewarped p...
متن کاملSubspace operations in affine Klingenberg spaces
In two previous papers we introduced the notion of an Affine Klingenberg space A and presented a geometric description of its free subspaces. Presently, we consider the operations of join, intersection and parallelism on the free subspaces of A. As in the case of ordinary affine spaces, we obtain the Parallel Postulate. The situation with join and intersection is not that straightforward. In pa...
متن کاملSpherical subspace and eigen based affine projection algorithms
In this paper, we combine spherical subspace (SS) and eigen based updating methods with the a ne projection (AP) method to produce a new family of fast SS-AP algorithms that o ers additional tradeo s between computation and adaptive ltering performance. Moreover, the implementation of SS-AP is less complicated than the fast RLS based AP algorithms. For certain applications, e.g., echo cancellat...
متن کاملSymmetry-free SDP Relaxations for Affine Subspace Clustering
We consider clustering problems where the goal is to determine an optimal partition of a given point set in Euclidean space in terms of a collection of affine subspaces. While there is vast literature on heuristics for this kind of problem, such approaches are known to be susceptible to poor initializations and getting trapped in bad local optima. We alleviate these issues by introducing a semi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: E?pijournal de ge?ome?trie alge?brique
سال: 2023
ISSN: ['2491-6765']
DOI: https://doi.org/10.46298/epiga.2023.9382